Constraint-based verification of abstract models of multitreaded programs

Constraint-based automatic verification of abstract models of multithreaded programs

We present a technique for the automated verification of abstract models of multithreaded programs providing fresh name generation, name mobility, and unbounded control. As high level specification language we adopt here an extension of communication finitestate machines with local variables ranging over an infinite name domain, called TDL programs. Communication machines have been proved very ...

CDB-PV: A Constraint Database-Based Program Verifier

In this paper we present a new system called CDB-PV that uses constraint databases (CDBs) for program verification (PV). The CDB-PV system was implemented in C++ and tested on several sample programs that are difficult to verify using other methods. The CDB-PV system also runs efficiently for the sample programs. The CDB-PV approach is similar to abstract interpretation but it allows non-convex...

Runtime verification of programs using rule-based active system

Abstract Verification and Debugging of Constraint Logic Programs

Verification and Debugging of Constraint Logic Programs Manuel Hermenegildo, Germán Puebla, Francisco Bueno, and Pedro López-Garćıa {herme,german,bueno,pedro}@fi.upm.es Department of Computer Science Technical University of Madrid (UPM)

Refining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques

Abstract interpretation based value analysis is a classical approach for verifying programs with floating-point computations. However, state-of-the-art tools compute an over-approximation of the variable values that can be very coarse. In this paper, we show that constraint solvers can significantly refine the approximations computed with abstract interpretation tools. We introduce a hybrid app...